Globally Rigid Augmentation of Rigid Graphs

Globally rigid frameworks and rigid tensegrity graphs in the plane

Combining Globally Rigid Frameworks

Here it is shown how to combine two generically globally rigid bar frameworks in d-space to get another generically globally rigid framework. The construction is to identify d+1 vertices from each of the frameworks and erase one of the edges that they have in common.

Globally consistent rigid registration

In this paper we present a novel approach to register multiple scans from a static object. We formulate the registration problem as an optimization of the maps from all other scans to one reference scan where any map between two scans can be represented by the composition of these maps. In this way, all loop closures can be automatically guaranteed as the maps among all scans are globally consi...

l 1 - Rigid Graphs

An l 1-graph is a graph whose nodes can be labeled by binary vectors in such a way that the Hamming distance between the binary addresses is, up to scale, the distance in the graph between the corresponding nodes. We show that many interesting graphs are l 1-rigid, i.e., that they admit an essentially unique such binary labeling.

Generically globally rigid zeolites in the plane

A d-dimensional zeolite is a d-dimensional body-and-pin framework with a (d+1)-regular underlying graph G. That is, each body of the zeolite is incident with d+1 pins and each pin belongs to exactly two bodies. The corresponding d-dimensional combinatorial zeolite is a bar-and-joint framework whose graph is the line graph of G. We show that a two-dimensional combinatorial zeolite is generically...